Voting under Constraints

نویسندگان

  • Salvador Barbera
  • Jordi Masso
  • Alejandro Neme
چکیده

We consider a broad class of situations where a society must choose from a finite set of alternatives. This class includes, as polar cases, those where the preferences of agents are completely unrestricted and those where their preferences are single-peaked. We prove that strategy-proof mechanisms in all these domains must be based on a generalization of the median voter principle. Moreover, they must satisfy a property, to be called the ``intersection property,'' which becomes increasingly stringent as the preference domain is enlarged. In most applications, our results precipitate impossibility theorems. In particular, they imply the Gibbard Satterthwaite theorem as a corollary. Journal of Economic Literature Classification Number: D71. 1997 Academic Press

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Receipt-Free Homomorphic Elections and Write-in Ballots

Abstract. We present a voting protocol that protects voters’ privacy and achieves universal verifiability, receipt-freeness, and uncoercibility without ad hoc physical assumptions or procedural constraints (such as untappable channels, voting booths, smart cards, third-party randomizers, and so on). We discuss under which conditions the scheme allows voters to cast write-in ballots, and we show...

متن کامل

Condorcet Consistent Bundling with Social Choice

We study the problem of computing optimal bundles given agents’ preferences over individual items when agents derive satisfaction from the entire bundle under constraints on the size k of the bundle. Building on the notion of Condorcet winning sets by Gehrlein [16], we extend common Condorcet consistent voting rules from the single winner voting setting to that of forming bundles of size k. Our...

متن کامل

Voting by committees under constraints

We consider social choice problems where a society must choose a subset from a set of objects. Specifically, we characterize the families of strategy-proof voting procedures when not all possible subsets of objects are feasible, and voters’ preferences are separable or additively representable. Journal of Economic Literature Classification Number: D7.

متن کامل

Public goods, participation constraints, and democracy: A possibility theorem

It is well known that ex post e¢ cient mechanisms for the provision of indivisible public goods are not interim individually rational. However, the corresponding literature assumes that agents who veto a mechanism can enforce a situation in which the public good is never provided. This paper instead considers majority voting with uniform cost sharing as the relevant status quo. E¢ cient mechani...

متن کامل

On swap-distance geometry of voting rules

Axioms that govern our choice of voting rules are usually defined by imposing constraints on the rule’s behavior under various transformations of the preference profile. In this paper we adopt a different approach, and view a voting rule as a (multi-)coloring of the election graph—the graph whose vertices are elections over a given set of candidates, and two vertices are adjacent if they can be...

متن کامل

Receipt-Free Homomorphic Elections and Write-in Voter Verified Ballots

We present a voting protocol that protects voters’ privacy and achieves universal verifiability, receipt-freeness, and uncoercibility without ad hoc physical assumptions or procedural constraints (such as untappable channels, voting booths, smart cards, third-party randomizers, and so on). We discuss under which conditions the scheme allows voters to cast write-in ballots, and we show how it ca...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997